Window-accumulated subsequence matching problem is linear
نویسندگان
چکیده
منابع مشابه
Window - Accumulated Subsequence matching Problem
Given two strings, text t of length n, and pattern p = p1 : : : pk of length k, and given a natural number w, the subsequence matching problem consists in nding the number of size w windows of text t which contain pattern p as a subsequence, i.e. the letters p1 ; : : : ; pk occur in the window, in the same order as in p, but not necessarily consecutively (they may be interleaved with other lett...
متن کاملLinear Detrending Subsequence Matching in Time-Series Databases
Each time-series has its own linear trend, the directionality of a timeseries, and removing the linear trend is crucial to get the more intuitive matching results. Supporting the linear detrending in subsequence matching is a challenging problem due to a huge number of possible subsequences. In this paper we define this problem the linear detrending subsequence matching and propose its efficien...
متن کاملWindow Subsequence Problems for Compressed Texts
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or finding the number of size (at most) w windows of text t which contain pattern p as a subsequence, i.e. the letters of pattern p occur in the text window, in the same order as in p, but not necessarily consecutively (they ...
متن کاملA Cover-Merging-Based Algorithm for the Longest Increasing Subsequence in a Sliding Window Problem
A longest increasing subsequence problem (LIS) is a well-known combinatorial problem with applications mainly in bioinformatics, where it is used in various projects on DNA sequences. Recently, a number of generalisations of this problem were proposed. One of them is to find an LIS among all fixed-size windows of the input sequence (LISW). We propose an algorithm for the LISW problem based on c...
متن کاملAn almost-linear time and linear space algorithm for the longest common subsequence problem
There are two general approaches to the longest common subsequence problem. The dynamic programming approach takes quadratic time but linear space, while the non-dynamic-programming approach takes less time but more space. We propose a new implementation of the latter approach which seems to get the best for both time and space for the
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2001
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(01)00051-3